Disjunctive Explanations
نویسندگان
چکیده
Abductive logic programming has been widely used to declaratively specify a variety of problems in AI including updates in data and knowledge bases, belief revision, diagnosis, causal theory, and default reasoning. One of the most signi cant issues in abductive logic programming is to develop a reasonable method for knowledge assimilation, which incorporates obtained explanations into the current knowledge base. This paper o ers a solution to this problem by considering disjunctive explanations whenever multiple explanations exist. Disjunctive explanations are then to be assimilated into the knowledge base so that the assimilated program preserves all and only minimal answer sets from the collection of all possible updated programs. We describe a new form of abductive logic programming which deals with disjunctive explanations in the framework of extended abduction. The proposed framework can be well applied to view updates in disjunctive databases.
منابع مشابه
Link Oping Electronic Articles in Disjunctive Explanations in Abductive Logic Programming
Given some evidence or observation, abduction infers candidate hypotheses to explain such an observation. In this paper, we consider the case in which multiple explanations exist but we cannot select one from them. Our approach leaves the decision inde nite, but o ers a consistent way to theory changes. A disjunctive explanation, which is a disjunction of possible alternative explanations, is i...
متن کاملRelevant Explanations: Allowing Disjunctive Assignments
Relevance-based explanation is a scheme in which partial assignments to Bayesian belief network variables are explanations ( abduc tive conclusions). We allow variables to re main unassigned in explanations as long as they are irrelevant to the explanation, where irrelevance is defined in terms of statistical in dependence. When multiple-valued variables exist in the system, especially when ...
متن کاملTransforming Abductive Logic Programs to Disjunctive Programs
A new xpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the xpoint of a disjunctive program obtained by a suitable program transformation. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are dealt with uniformly. This characterizati...
متن کاملThe Complexity of Inferences and Explanations in Probabilistic Logic Programming
A popular family of probabilistic logic programming languages combines logic programs with independent probabilistic facts. We study the complexity of marginal inference, most probable explanations, and maximum a posteriori calculations for propositional/relational probabilistic logic programs that are acyclic/definite/stratified/normal/ disjunctive. We show that complexity classes Σk and PP Σk...
متن کاملHow to define levels of explanation and evaluate their indispensability
Some explanations in social science, psychology and biology belong to a higher level than other explanations. And higher explanations possess the virtue of abstracting away from the details of lower explanations, many philosophers argue. As a result, these higher explanations are irreplaceable. And this suggests that there are genuine higher laws or patterns involving social, psychological and ...
متن کامل